linear complexity造句
例句與造句
- on the variance of the linear complexity of random periodic sequences
隨機(jī)周期序列線性復(fù)雜度的方差 - family of nonlinear filter functions with large linear complexity
一類具有大線性復(fù)雜度的非線性過(guò)濾函數(shù) - a fast algorithm for determining the linear complexity in periodic sequences
求周期序列線性復(fù)雜度的快速算法 - an estimation of upper bound for linear complexity abut linear sequences
線性序列線性復(fù)雜度均值的一個(gè)上界估計(jì) - 6 . three fast algorithms for determining the k-error linear complexity of periodic sequences are proposed
提出三個(gè)計(jì)算周期序列k-錯(cuò)線性復(fù)雜度的快速算法。 - It's difficult to find linear complexity in a sentence. 用linear complexity造句挺難的
- the structures of input arrays of three classes of feedforward arrays with maximal linear complexities are discussed
摘要討論了三類達(dá)到極大線性復(fù)雜度的前饋陣列的輸入陣列的結(jié)構(gòu)。 - and the properties such as correlation function, linear complexity and balance property are analyzed theoretically
然后從理論上分析了混沌序列的相關(guān)特性、平衡特性和線性復(fù)雜度等性能。 - 7 . the concept of q-ary geffe sequence is introduced, and the period and the linear complexity of n-ary geffe sequence are investigated
提出多元geffe序列的概念，并給出多元geffe序列的周期和線性復(fù)雜度的表達(dá)式。 - on the other hand, on condition that the clock-controlled sequence is generalized self-shrinking sequences, the sequences generated have good a;-error linear complexity
在被控序列為廣義自縮序列情況下，序列有好的k-錯(cuò)線性復(fù)雜度性質(zhì)。 - examples and comparisons with some other image interpolation methods show that the new image interpolation algorithm has the advantage of good edge preservation, linear complexity and easy implementation
與傳統(tǒng)的插值算法相比，其邊界處理效果好，具有線性復(fù)雜度且易于實(shí)現(xiàn)。 - in chapter 6, the characteristics qualities relative to the spreading codes generated by ar filter are studied in this paper . such as correlative character, codes balance, linear complexity
因此在第六章中,本文就擴(kuò)頻序列所必須具備的幾個(gè)特性對(duì)所產(chǎn)生的擴(kuò)頻序列進(jìn)行了理論分析和實(shí)驗(yàn)仿真。 - in particular, if the connection integer is a prime number p, then the proportion of 1's in a segment of l-sequence with length t ( 0 < < 1 ) satisfies next the linear complexity of l-sequences is discussed
特別的，若聯(lián)接數(shù)為素?cái)?shù)p，則l-序列在長(zhǎng)為t(01)的任意一段中出現(xiàn)1的個(gè)數(shù)所占的比例( - 3 . a fast algorithm is proposed for computing the linear complexity of a binary sequence with period p ? and generalized one for determining the linear complexity of a sequence with period pfl over gf ( q )
提出了一個(gè)計(jì)算周期為p~n的二元序列的線性復(fù)雜度的快速算法，并推廣為確定gf（q）上周期為p~n的序列線性復(fù)雜度的快速算法。 - 3 . a fast algorithm is proposed for computing the linear complexity of a binary sequence with period p ? and generalized one for determining the linear complexity of a sequence with period pfl over gf ( q )
提出了一個(gè)計(jì)算周期為p~n的二元序列的線性復(fù)雜度的快速算法，并推廣為確定gf（q）上周期為p~n的序列線性復(fù)雜度的快速算法。 - this solution method has a linear complexity both in time and space, and its numerical stability is similar to that of overall selected host element with normalization, hence remarkably improves the efficiency of floater's algorithm
該解法在時(shí)間和空間上都獲得了線性復(fù)雜度，其數(shù)值穩(wěn)定性與標(biāo)度化全選主元素法相同，從而顯著提高了floater方法的效率。
更多例句： 下一頁(yè)